Perfect Mannheim, Lipschitz and Hurwitz weight codes
نویسنده
چکیده
The set of residue classes modulo an element π in the rings of Gaussian integers, Lipschitz integers and Hurwitz integers, respectively, is used as alphabets to form the words of error correcting codes. An error occurs as the addition of an element in a set E to the letter in one of the positions of a word. If E is a group of units in the original rings, then we obtain the Mannheim, Lipschitz and Hurwitz metrics, respectively. Some new perfect 1-error-correcting codes in these metrics are constructed. The existence of perfect 2-error-correcting codes is investigated by computer search. AMS subject classifications: 94B05, 94B15, 94B35, 94B60
منابع مشابه
Codes over Hurwitz integers
In this study, we obtain new classes of linear codes over Hurwitz integers equipped with a new metric. We refer to the metric as Hurwitz metric. The codes with respect to Hurwitz metric use in coded modulation schemes based on quadrature amplitude modulation (QAM)-type constellations, for which neither Hamming metric nor Lee metric. Also, we define decoding algorithms for these codes when up to...
متن کاملAnother discrete Fourier transform pairs associated with the Lipschitz-Lerch zeta function
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: Keywords: Discrete Fourier transform Alternating zeta functions Hurwitz–Lerch zeta function Lipschitz–Lerch zeta function Le...
متن کاملEASY PROOFS OF RIEMANN’S FUNCTIONAL EQUATION FOR ζ(s) AND OF LIPSCHITZ SUMMATION
We present a new, simple proof, based upon Poisson summation, of the Lipschitz summation formula. A conceptually easy corollary is the functional relation for the Hurwitz zeta function. As a direct consequence we obtain a short, motivated proof of Riemann’s functional equation for ζ(s). Introduction We present a short and motivated proof of Riemann’s functional equation for Riemann’s zeta funct...
متن کاملOn non-full-rank perfect codes over finite fields
The paper deals with the perfect 1-error correcting codes over a finite field with q elements (briefly q-ary 1-perfect codes). We show that the orthogonal code to the q-ary non-full-rank 1-perfect code of length n = (q − 1)/(q − 1) is a q-ary constant-weight code with Hamming weight equals to qm−1 where m is any natural number not less than two. We derive necessary and sufficient conditions for...
متن کاملPerfect binary codes: constructions, properties, and enumeration
Properties of nonlinear perfect binary codes are investigated and several new constructions of perfect codes are derived from these properties. An upper bound on the cardinality of the intersection of two perfect codes of length n is presented, and perfect codes whose intersection attains the upper bound are constructed for all n. As an immediate consequence of the proof of the upper bound we o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1201.3315 شماره
صفحات -
تاریخ انتشار 2012